An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
نویسندگان
چکیده
منابع مشابه
An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
A version of the fast multipole method (FMM) is described for charge distributions on the line. Previously published schemes of this type relied either on analytical representations of the potentials to be evaluated (multipoles, Legendre expansions, Taylor series, etc.) or on tailored representations that were constructed numerically (using, e.g., the singular value decomposition (SVD), artific...
متن کاملA SVD accelerated kernel-independent fast multipole method and its application to BEM
The kernel-independent fast multipole method (KIFMM) proposed in [1] is of almost linear complexity. In the original KIFMM the time-consuming M2L translations are accelerated by FFT. However, when more equivalent points are used to achieve higher accuracy, the efficiency of the FFT approach tends to be lower because more auxiliary volume grid points have to be added. In this paper, all the tran...
متن کاملA Fourier-series-based kernel-independent fast multipole method
We present in this paper a new kernel-independent fast multipole method (FMM), named as FKI-FMM, for pairwise particle interactions with translation-invariant kernel functions. FKI-FMM creates, using numerical techniques, sufficiently accurate and compressive representations of a given kernel function over multi-scale interaction regions in the form of a truncated Fourier series. It provides al...
متن کاملA kernel-independent fast multipole algorithm
We present a new fast multipole method for particle simulations. The main feature of our algorithm is that is kernel independent, in the sense that no analytic expansions are used to represent the far field. Instead we use equivalent densities, which we compute by solving small Dirichlet-type boundary value problems. The translations from the sources to the induced potentials are accelerated by...
متن کاملA kernel independent fast multipole algorithm for radial basis functions
We present a fast multipole algorithm for the evaluation of pairwise interaction through the radial basis functions such as 1/r, ffiffiffiffiffiffiffiffiffiffiffiffiffiffi r2 þ a2 p and 1= ffiffiffiffiffiffiffiffiffiffiffiffiffiffi r2 þ a2 p (with a > 0) in both two and three dimensions. Our algorithm is an extension of the kernel independent fast multipole method presented in Ying et al. [L. Y...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2007
ISSN: 1064-8275,1095-7197
DOI: 10.1137/060662253